Agglomerative Hierarchical Clustering For Musical Database Visualization and Browsing
نویسندگان
چکیده
We propose an automated system which is based on agglomerative hierarchical clustering and automatically organizes a collection of music files according to musical surface characteristics (e.g., zero crossings, short-time energy, etc.) and tempo. The system architecture is based on three distinct yet inter-related processes, namely: (a) Preprocessing (format normalization and extraction of fifteen features per song), (b) Retrieval and (c) Browsing. The organization of music files is visualized via a dendrogram in which every leaf of the tree represents a music file and musical similarity decreases with height. Additionally, our system is complemented by a Query-By-Example (Q.B.E.) retrieval subsystem, the results of which are also returned to the user in dendrogram form.
منابع مشابه
Implementation of Hybrid Clustering Algorithm with Enhanced K-Means and Hierarchal Clustering
We are propose a hybrid clustering method, the methodology combines the strengths of both partitioning and agglomerative clustering methods. Clustering algorithms that build meaningful hierarchies out of large document collections are ideal tools for their interactive visualization and exploration as they provide data-views that are consistent, predictable, and at different levels of granularit...
متن کاملInteractive Visualization of Hierarchical Clusters Using MDS and MST
In this paper, we discuss interactively visualizing hierarchical clustering using multidimensional scaling (MDS) and the minimal spanning tree (MST). We can examine the sequential process leading to agglomerative or divisive hierarchical clustering, compare the di erent agglomerative methods, and detect in uential observations better than is possible with dendrograms.
متن کاملHierarchical browsing and search of large image databases
The advent of large image databases (>10000) has created a need for tools which can search and organize images automatically by their content. This paper focuses on the use of hierarchical tree-structures to both speed-up search-by-query and organize databases for effective browsing. The first part of this paper develops a fast search algorithm based on best-first branch and bound search. This ...
متن کاملSimilarity pyramids for browsing and organization of large image databases
The advent of large image databases (>10,000) has created a need for tools which can search and organize images automatically by their content. This paper presents a method for designing a hierarchical browsing environment which we call a similarity pyramid. The similarity pyramid groups similar images together while allowing users to view the database at varying levels of resolution. We show t...
متن کاملInterpreting and Extending Classical Agglomerative Clustering Algorithms using a Model-Based approach
We present two results which arise from a model-based approach to hierarchical agglomerative clustering. First, we show formally that the common heuristic agglomerative clustering algorithms – Ward’s method, single-link, complete-link, and a variant of group-average – are each equivalent to a hierarchical model-based method. This interpretation gives a theoretical explanation of the empirical b...
متن کامل